Twisted Reed–Solomon Codes With One-Dimensional Hull

نویسندگان

چکیده

The hull of a linear code is defined to be the intersection and its dual. When size small, it has been proved that some algorithms for checking permutation equivalence two codes computing automorphism group are very effective in general. Maximum distance separable (MDS) meeting Singleton bound. Twisted Reed-Solomon generalization codes, which also nice construction MDS codes. In this short letter, we obtain twisted with one-dimensional hull. Moreover, these not monomially equivalent

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One generator $(1+u)$-quasi twisted codes over $F_2+uF_2$

This paper gives the minimum generating sets of three types of one generator (1 + u)-quasi twisted (QT) codes over F 2 + uF 2 , u 2 = 0. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of A 2 type one generator (1 + u)-QT codes. Some good (optimal or suboptimal) linear codes over F 2 are obtained by these types of one generator (1 +...

متن کامل

A generalization of quasi-twisted codes: Multi-twisted codes

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods o...

متن کامل

Generalised Twisted Gabidulin Codes

We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.

متن کامل

Generalized Twisted Gabidulin Codes

Based on the twisted Gabidulin codes obtained recently by Sheekey, we construct a new family of maximal rank distance codes as a set of qpolynomials over Fqn , which includes the generalized Gabidulin codes and the twisted Gabidulin codes. Their Delsarte duals and adjoint codes are investigated. We also obtain necessary and sufficient conditions for the equivalence between two members of our ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2021

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2020.3025178